package leetcode.a_总结分布;

import leetcode.top100.*;

/**
 * 树相关题目总结
 * @date 2020/5/24 16:15
 */
public class Code06_二叉树相关拓展 {

    /**
     * 树的四种遍历
     * {@link baseclass.e_tree.Code01_ThreeTraverse}
     * {@link baseclass.e_tree.Code08_LevelTraverse}
     */
    public void traverse(){}

    /**
     * 基于中序遍历的题目
     * {@link baseclass.e_tree.Code02_AfterNode_后继节点}
     * {@link baseclass.e_tree.Code03_PreNode_前驱节点}
     * {@link leetcode.top100.Code98_IsValidBST}
     */
    public void inTraverse(){}

    /**
     * 基于水平遍历的题目
     * {@link offerbook.Code60_LevelPrintTree}
     * {@link offerbook.Code61_LevelZigZagPrintTree}
     */
    public void levelTraverse(){}

    /**
     * 序列化
     * {@link baseclass.e_tree.Code04_SerializeAndReconstructTree}
     */
    public void serialize(){}

    /**
     * 反转或判断是否对称
     * {@link leetcode.pre100.Code100_IsSameTree}
     * {@link baseclass.e_tree.Code11_ReverseBT}
     */
    public void isSame(){}

    /**
     * 其他利用遍历相关
     * {@link baseclass.e_tree.Code06_IsBalanceTree}
     */
    public void traverseMethod(){}

    /**
     * 二叉搜索树相关
     * {@link leetcode.pre100.Code95_BSTNums_二叉搜索树个数1}
     * {@link leetcode.pre100.Code96_BSTNums_二叉搜索树个数2}
     * {@link leetcode.top100.Code98_IsValidBST}
     * {@link leetcode.pre100.Code99_recoverTree_恢复二叉搜索树}
     */
    public void BST(){}


    /**
     * 基于树的高度的扩展题目
     * {@link leetcode.top100.Code104_二叉树深度}
     * {@link leetcode.top100.Code124_MaxTreePathSum_二叉树最大路径和}
     * {@link leetcode.top100.Code543_二叉树直径}
     */
    public void height(){}
}
